tg-me.com/prograchallenges/601
Create:
Last Update:
Last Update:
ART GALLERY PROBLEM
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a set of points in two-dimensional space that represent the corners of a polygon, implement a function that finds the smallest number of guards that can be placed at the vertices of the polygon such that every point on the interior of the polygon is visible to at least one guard, using the Chvátal's algorithm
+========+
Please answer to this message with your solution 🙂
BY Programming Challenges
Warning: Undefined variable $i in /var/www/tg-me/post.php on line 283
Share with your friend now:
tg-me.com/prograchallenges/601